const runtime.heapBitsShift
29 uses
runtime (current package)
mbitmap.go#L59: heapBitsShift = 1 // shift offset between successive bitPointer or bitScan entries
mbitmap.go#L63: bitScanAll = bitScan | bitScan<<heapBitsShift | bitScan<<(2*heapBitsShift) | bitScan<<(3*heapBitsShift)
mbitmap.go#L64: bitPointerAll = bitPointer | bitPointer<<heapBitsShift | bitPointer<<(2*heapBitsShift) | bitPointer<<(3*heapBitsShift)
mbitmap.go#L436: if h.shift < 3*heapBitsShift {
mbitmap.go#L437: h.shift += heapBitsShift
mbitmap.go#L482: n += uintptr(h.shift) / heapBitsShift
mbitmap.go#L484: h.shift = uint32(n%4) * heapBitsShift
mbitmap.go#L837: mask2 = bitPointer | bitScan | mask1<<heapBitsShift // 00110011
mbitmap.go#L838: mask3 = bitPointer | bitScan | mask2<<heapBitsShift // 01110111
mbitmap.go#L888: *h.bitp &^= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
mbitmap.go#L892: *h.bitp |= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
mbitmap.go#L909: *h.bitp &^= (bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << h.shift
mbitmap.go#L947: hb |= hb & (bitScan << (2 * heapBitsShift)) >> 1
mbitmap.go#L1202: hb = (b & (bitPointer | bitPointer<<heapBitsShift)) << (2 * heapBitsShift)
mbitmap.go#L1203: hb |= bitScan << (2 * heapBitsShift)
mbitmap.go#L1205: hb |= bitScan << (3 * heapBitsShift)
mbitmap.go#L1209: *hbitp &^= uint8((bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << (2 * heapBitsShift))
mbitmap.go#L1327: *hbitp = *hbitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | uint8(hb)
mbitmap.go#L1354: *h.bitp = *h.bitp&^((bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift)<<(2*heapBitsShift)) | *src
mbitmap.go#L1380: *h.bitp = *h.bitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | *src
mbitmap.go#L1412: end.shift += heapBitsShift
mbitmap.go#L1413: if end.shift == 4*heapBitsShift {